John Wickham Legg, F.S.A.

FSA-based Packet Filters

We propose a packet filtering technique based on the generation and composition of Finite-State Automata (FSA), in contrast to most traditional imperative approaches. FSAs provide a formal framework with well-defined composition operations and enable the generation of optimized executable code without resorting to multiple and opportunistic optimization algorithms. Memory safety in filters is e...

The SCM FSA Computer

(2) Let N be a non empty set with non empty elements, and let S be a definite AMI over N , and let s be a state of S, and let i be an instructionlocation of S. Then s(i) is an instruction of S. (3) Let N be a non empty set with non empty elements, and let S be an AMI over N , and let s be a state of S. Then the instruction locations of S ⊆ dom s. (4) Let N be a non empty set with non empty elem...

Automatic Construction of FSA Language Model for Speech Recognition by FSA DP-Matching

Further Thoughts on the Third Stage - Sara Wickham

© www.sarawickham.com This article first published 1999 Practising Midwife 2(10):14-15. Republished with permission for personal use only. Page numbers do not correspond to the original. Please do not reproduce/reprint without prior permission, thank you. The third stage of labour has, for some time, been one of the hottest clinical topics in midwifery. Although both of the major research studi...

Decision Tree Induction using Adaptive FSA

This paper introduces a new algorithm for the induction of decision trees, based on adaptive techniques. One of the main feature of this algorithm is the application of automata theory to formalize the problem of decision tree induction and the use of a hybrid approach, which integrates both syntactical and statistical strategies. Some experimental results are also presented indicating that the...